Solving hard control problems in voting systems via integer programming
نویسندگان
چکیده
منابع مشابه
Solving Hard Control Problems in Voting Systems via Integer Programming
We address various voting systems and types of control of elections and show how hard control problems can be modeled as integer programs. By means of the off-the-shelf solver Cplex we then demonstrate that the approach allows to treat the control of larger elections successfully. As a consequence, the hardness of a certain control problem is not a secure protection for the fraudulent falsifica...
متن کاملA new approach for solving neutrosophic integer programming problems
Linear programming is one of the most important usages of operation research methods in real life, that includes of one objective function and one or several constraints which can be in the form of equality and inequality. Most of the problems in the real world are include of inconsistent and astute uncertainty, because of this reason we can’t obtain the optimal solution easily. In this paper, ...
متن کاملSolving Tantrix via Integer Programming
Tantrix is a puzzle to make a loop by connecting lines drawn on hexagonal tiles, and the objective of this research is to solve it by a computer. For this purpose, we give a problem setting of solving Tantrix as arranging tiles in an appropriate shape and making a loop at the same time within a given hexagonal lattice board. We then formulate it as an integer program by expressing the rules of ...
متن کاملConflict graphs in solving integer programming problems
We report on the use of con ict graphs in solving integer programs A con ict graph represents logical relations between binary variables We develop algorithms and data structures that allow the e ective and e cient construction management and use of dynamically changing con ict graphs Our computational experiments show that the techniques presented work very well
متن کاملSolving Rummikub Problems by Integer Linear Programming
The Rummikub problem of finding the maximal number or value of the tiles that can be placed from your rack onto the table is very difficult, since the number of possible combinations are enormous. We show that this problem can be modeled as an integer linear programming problem. In this way solutions can be found in 1 s. We extend the model such that unnecessary changes of the existing sets on ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2016
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2015.08.052